Genetic Local Search for the Servers Load Balancing Problem
نویسندگان
چکیده
In this work we consider the servers load balancing problem (SLBP) formulated as a mixed integer linear programming problem. As known, this problem is NP-hard in strong sense. We analyze the approximability of the problem and prove that SLBP is Log-APX-hard under PTAS-reducibility and cannot be NPO-complete unless P=NP. To solve the problem we develop an approximate method using the idea of genetic local search. Computational results are discussed.
منابع مشابه
Load Balancing Approaches for Web Servers: A Survey of Recent Trends
Numerous works has been done for load balancing of web servers in grid environment. Reason behinds popularity of grid environment is to allow accessing distributed resources which are located at remote locations. For effective utilization, load must be balanced among all resources. Importance of load balancing is discussed by distinguishing the system between without load balancing and with loa...
متن کاملA Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملMulticriterion Evolutionary Algorithm for Workload Balancing of the Web Bank Servers
Load balancing of the Internet bank can be implemented by reduction of the workload of the bottleneck Web server. Load balancing improves both a performance of the computer system and the reliability of a server network. An evolutionary algorithm improved by introducing a tabu search procedure is discussed for solving multi-criteria optimization problem of finding a set of Pareto-suboptimal tas...
متن کاملPareto-optimal Load Solutions in the I-Banking by Evolutionary Algorithm
Load balancing of the Web bank servers can be implemented by minimization of the workload of the bottleneck Web server. Load balancing improves both a performance of the system and the safety of the bottleneck computers. An evolutionary algorithm based on a tabu search procedure is discussed for solving multi-criteria optimization problem of finding a set of Pareto-suboptimal task assignments. ...
متن کاملARTÍCULO Pareto-optimal Load Solutions in the I-Banking by Evolutionary Algorithm
Load balancing of the Web bank servers can be implemented by minimization of the workload of the bottleneck Web server. Load balancing improves both a performance of the system and the safety of the bottleneck computers. An evolutionary algorithm based on a tabu search procedure is discussed for solving multi-criteria optimization problem of finding a set of Pareto-suboptimal task assignments. ...
متن کامل